skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Zirlin, Dara"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; (, Discrete Mathematics)
    Full Text Available 
  2. ; ; ; (, Journal of Graph Theory)
    Full Text Available 
  3. ; ; ; (, Journal of Graph Theory)
    Abstract The ‐deckof an ‐vertex graph is the multiset of subgraphs obtained from it by deleting vertices. A family of ‐vertex graphs is ‐recognizableif every graph having the same ‐deck as a graph in the family is also in the family. We prove that the family of ‐vertex graphs with no cycles is ‐recognizable when (except for ). As a consequence, the family of ‐vertex trees is ‐recognizable when and . It is known that this fails when . 
    more » « less
  4. ; ; ; (, Pure and Applied Mathematics Quarterly)
    Full Text Available 
  5. ; ; ; (, The Electronic Journal of Combinatorics)
    A hypergraph $$\mathcal H$$ is super-pancyclic if for each $$A \subseteq V(\mathcal H)$$ with $$|A| \geqslant 3$$, $$\mathcal H$$ contains a Berge cycle with base vertex set $$A$$. We present two natural necessary conditions for a hypergraph to be super-pancyclic, and show that in several classes of hypergraphs these necessary conditions are also sufficient. In particular, they are sufficient for every hypergraph $$\mathcal H$$ with $$ \delta(\mathcal H)\geqslant \max\{|V(\mathcal H)|, \frac{|E(\mathcal H)|+10}{4}\}$$. We also consider super-cyclic bipartite graphs: those are $(X,Y)$-bigraphs $$G$$ such that for each $$A \subseteq X$$ with $$|A| \geqslant 3$$, $$G$$ has a cycle $$C_A$$ such that $$V(C_A)\cap X=A$$. Such graphs are incidence graphs of super-pancyclic hypergraphs, and our proofs use the language of such graphs. 
    more » « less
    Full Text Available